package DataStructures;

/*
 * Node structure for a binary tree
 */

public class TNode <T>{
	
	private T info;
	private TNode<T> left;
	private TNode<T> right;
	
	public TNode (){
		
		info = null;
		left = null;
		right = null;
	}
	
	public TNode (T e){
		
		info = e;
		left = null;
		right = null;
	}
	
	public T getInfo(){
		
		return info;
	}
	
	public void setLeft (TNode<T> i){
		
		left = i;
	}
	
	public TNode<T> getLeft(){
		
		return left;
	}
	
public void setRight (TNode<T> i){
		
		right = i;
	}
	
	public TNode<T> getRight(){
		
		return right;
	}
}
